Production Optimization – Facilitated by Divide and Conquer Strategies

نویسندگان

  • Bjarne Foss
  • Bjarne Grimstad
  • Vidar Gunnerud
چکیده

This paper explores the use of divide and conquer algorithms to solve production optimization problems. Exploitation of inherent structure facilitates efficient formulations and solutions to production optimization problems that frequently appear in the upstream oil and gas sector. We present the daily production optimization, which gives rise to network optimization problems, and also add some comments to the closely linked reservoir optimization problem. Subsequently, a common non-invasive optimization approach is presented prior to three concepts that apply decomposition and structure exploitation. The first approach splits a network simulator into interconnected parts and exploits the local components and their couplings in devising efficient formulations and algorithms. This opens for a range of opportunities in terms of formulations and algorithms, several of which will be discussed. This part is accompanied by a realistic numerical study. The second approach exploits a decomposable network structure, which frequently appears in large production systems, by applying a Lagrangian type decomposition. The last approach deals with reservoir optimization where there is no apparent structure to exploit. However, by recognizing this as a dynamic optimization problem, it may be split in the time domain. The paper ends with some conclusions.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Free Vibration Analysis of Repetitive Structures using Decomposition, and Divide-Conquer Methods

This paper consists of three sections. In the first section an efficient method is used for decomposition of the canonical matrices associated with repetitive structures. to this end, cylindrical coordinate system, as well as a special numbering scheme were employed. In the second section, divide and conquer method have been used for eigensolution of these structures, where the matrices are in ...

متن کامل

Divide-and-conquer multiple alignment with segment-based constraints

A large number of methods for multiple sequence alignment are currently available. Recent benchmarking tests demonstrated that strengths and drawbacks of these methods differ substantially. Global strategies can be outperformed by approaches based on local similarities and vice versa, depending on the characteristics of the input sequences. In recent years, mixed approaches that include both gl...

متن کامل

Dampvm/dac Programming, Tuning and Automatic Parallelization of Irregular Divide-and-conquer Applications in Programming, Tuning and Automatic Parallelization of Irregular Divide-and-conquer Applications in Dampvm/dac

This paper presents a new object oriented framework DAMPVM/DAC which is implemented on top of DAMPVM and provides automatic partitioning of irregular divide-andconquer (DAC) applications at runtime. The processes are then mapped dynamically to processors taking into account their speeds and even loads by other user processes. The paper presents the programming interface (API) of the framework, ...

متن کامل

Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times - A Polymatroid Optimization Approach

We consider a variety of preemptive scheduling problems with controllable processing times on a single machine and on identical/uniform parallel machines, where the objective is to minimize the total compression cost. In this paper, we propose fast divide-and-conquer algorithms for these scheduling problems. Our approach is based on the observation that each scheduling problem we discuss can be...

متن کامل

Induction of Logic Programs by Example-Guided Unfolding

Resolution has been used as a specialisation operator in several approaches to top-down induction of logic programs. This operator allows the overly general hypothesis to be used as a declarative bias that restricts not only what predicate symbols can be used in produced hypotheses, but also how the predicates can be invoked. The two main strategies for top-down induction of logic programs, Cov...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015